| 翻訳と辞書 |
| Chromosome (genetic algorithm) ： ウィキペディア英語版 |
Chromosome (genetic algorithm)
In genetic algorithms, a chromosome (also sometimes called a genotype) is a set of parameters which define a proposed solution to the problem that the genetic algorithm is trying to solve. The set of all solutions is known as the ''population''.〔(【引用サイトリンク】url=http://www.obitko.com/tutorials/genetic-algorithms/ga-basic-description.php )〕 The chromosome is often represented as a binary string, although a wide variety of other data structures are also used.
==Chromosome design==
The design of the chromosome and its parameters is by necessity specific to the problem to be solved. Traditionally, chromosomes are represented in binary as strings of 0s and 1s, however other encodings are also possible; almost any representation which allows the solution to be represented as a finite-length string can be used.〔(【引用サイトリンク】url=http://www.optiwater.com/optiga/ga.html )〕 Finding a suitable representation of the problem domain for a chromosome is an important consideration, as a good representation will make the search easier by limiting the search space; similarly, a poorer representation will allow a larger search space.〔(【引用サイトリンク】url=http://www.cse.unsw.edu.au/~billw/cs9414/notes/ml/05ga/05ga.html )〕 The mutation operator and crossover operator employed by the genetic algorithm must also take into account the chromosome's design.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Chromosome (genetic algorithm)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|